全文获取类型
收费全文 | 410篇 |
免费 | 142篇 |
国内免费 | 21篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 6篇 |
2020年 | 11篇 |
2019年 | 8篇 |
2018年 | 2篇 |
2017年 | 23篇 |
2016年 | 27篇 |
2015年 | 20篇 |
2014年 | 34篇 |
2013年 | 29篇 |
2012年 | 31篇 |
2011年 | 24篇 |
2010年 | 20篇 |
2009年 | 43篇 |
2008年 | 32篇 |
2007年 | 30篇 |
2006年 | 32篇 |
2005年 | 18篇 |
2004年 | 30篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 21篇 |
2000年 | 15篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 3篇 |
1988年 | 2篇 |
排序方式: 共有573条查询结果,搜索用时 244 毫秒
51.
研究非齐次边界条件下,含有p-Laplacian算子的微分方程的可解性,在Banach空间中应用Krasnoselskii不动点定理,得到了边值问题正解存在性结果。 相似文献
52.
考虑制导炮弹由身管武器发射,其飞行控制能力和导引信息量有限,基于预测落点位置偏差量来修正速度方向并在控制时间内连续分配导引指令的思想,提出了一种新的三维末制导方法。根据非线性弹道方程组的级数解预测弹丸落点位置,得到落点与目标的偏差,并提出了两种通过此偏差解算当前速度方向修正量的方法。取剩余飞行时间为修正时间,通过将速度方向修正量分配到整个剩余导引段建立了加速度修正公式,以减小导引指令饱和的可能性。通过连续地预测落点和分配加速度指令来实时地导引飞行。仿真结果表明:该导引方法简单可行,精度高,对控制能力要求较低,且具备较好的制导效果和毁伤效果,为该体制制导炮弹的应用提供参考依据。 相似文献
53.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
54.
The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008 相似文献
55.
We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model. 相似文献
56.
提出一种在仿射变换下点集关系描述算子--面积比矩阵,证明了其在仿射变换群下的不变性质;并由该性质推导得出特征向量(EA)匹配算法抗噪性能差的原因,在此基础上给出了基于面积比矩阵的加权特征向量算法.算法构造不同图像的面积比矩阵,对矩阵进行分解得到其特征值和特征向量,通过特征值进行加权获得图像中点的特征向量,比较图像点的特征向量获取匹配关系.因面积比矩阵的仿射不变性质,算法能实现仿射变换下点集精确匹配;采用的加权特征向量法改进了EA匹配法,具有更好的抗噪性能.实验表明算法切实可行. 相似文献
57.
58.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
59.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
60.